SANGE - Stochastic Automata Networks Generator. A tool to efficiently predict events through structured Markovian models
نویسندگان
چکیده
The use of stochastic formalisms, such as Stochastic Automata Networks (SAN), can be very useful for statistical prediction and behavior analysis. Once well fitted, such formalisms can generate probabilities about a target reality. These probabilities can be seen as a statistical approach of knowledge discovery. However, the building process of models for real world problems is time consuming even for experienced modelers. Furthermore, it is often necessary to be a domain specialist to create a model. This work illustrates a new method to automatically learn simple SAN models directly from a data source. This method is encapsulated in a tool called SAN GEnerator (SANGE). This new model fitting method is powerful and relatively easy to use; therefore this can grant access to a much broader community to such powerful modeling formalisms.
منابع مشابه
Lumping-Based Equivalences in Markovian Automata and Applications to Product-Form Analyses
The analysis of models specified with formalisms like Markovian process algebras or stochastic automata can be based on equivalence relations among the states. In this paper we introduce a relation called exact equivalence that, differently from most aggegation approaches, induces an exact lumping on the underlying Markov chain instead of a strong lumping. We prove that this relation is a congr...
متن کاملMQNA - Markovian Queueing Networks Analyser
This paper describes the MQNA Markovian Queueing Networks Analyser, a software tool to model and obtain the stationary solution of a large class of Queueing Networks. MQNA can directly solve open and closed product-form queueing networks using classical algorithms. For finite capacity queueing models, MQNA generates Markovian description in the Stochastic Automata Networks (SAN) and Stochastic ...
متن کاملSimulation of Markovian models using bootstrap method
Simulation is an interesting alternative to solve Markovian models. However, when compared to analytical and numerical solutions it suffers from a lack of precision in the results due to the very nature of simulation, which is the choice of samples through pseudorandom generation. This paper proposes a different way to simulate Markovian models by using a Bootstrap-based statistical method to m...
متن کاملRational Automata Networks: A Non-Markovian Modeling Approach
A new class of non-Markovian models is introduced that results from the combination of stochastic automata networks and a very general class of stochastic processes namely rational arrival processes which are derived from matrix exponential distributions. It is shown that the modeling formalism allows a compact representation of complex models with large state spaces. The resulting stochastic p...
متن کاملMultistep Methods for Markovian Event Systems
We consider multistep methods for accelerated trajectory generation in the simulation of Markovian event systems, which is particularly useful in cases where the length of trajectories is large, e.g. when regenerative cycles tend to be long, when we are interested in transient measures over a finite but large time horizon, or when multiple time scales render the system stiff. 1. Markovian Event...
متن کامل